solving the single machine problem with quadratic earliness and tardiness penalties
Authors
abstract
nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinations in objective functions. however, minimizing the weighted quadratic earliness and tardiness penalties is considered in this paper. a branch and bound algorithm including some dominance rules, lower bounds and upper bounds is proposed to solve the problem. finally, the efficiency of proposed method is proved via some test problems .
similar resources
Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
full textHeuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a f...
full textA branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...
full textAn exact approach for single machine scheduling with quadratic earliness and tardiness penalties
her early schooling and unviersity preparatory studies in Qaemshahr. She then enrolled into Iran University of Science and Technology in Tehran after a highly selective admission procedure. In 2005, she finished her undergraduation studies in Mathematics with specialisation in topics of Applied Mathematics. After a brief 3-month training period spent working on updating flight managemeny system...
full textAn Adaptive Genetic Algorithm to the Single Machine Scheduling Problem with Earliness and Tardiness Penalties
This paper deals with the SingleMachine Scheduling Problem with Earliness and Tardiness Penalties, considering distinct due windows and sequence-dependent setup time. Due to its complexity, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous sear...
full textSingle Machine Common Due Date with Job Dependent Earliness and Tardiness Penalties Problem Using Neural Network
We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.
full textMy Resources
Save resource for easier access later
Journal title:
بین المللی مهندسی صنایع و مدیریت تولیدجلد ۲۲، شماره ۳، صفحات ۲۷۳-۲۸۱
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023